Automata and Square Complexes.
ثبت نشده
چکیده
We introduce a new geometric tool for analyzing groups of finite au-tomata. To each finite automaton we associate a square complex. The square complex is covered by a product of two trees iff the automaton is bi-reversible. Using this method we give examples of free groups and of Kazhdan groups which are generated by the different states of one finite (bi-reversible) automaton. We also reproduce the theorem of Macedo´nska, Nekrashevych, Sushchansky, on the connection between bi-reversible automata and the commensurator of a regular tree.
منابع مشابه
An Adaptive Congestion Alleviating Protocol for Healthcare Applications in Wireless Body Sensor Networks: Learning Automata Approach
Wireless Body Sensor Networks (WBSNs) involve a convergence of biosensors, wireless communication and networks technologies. WBSN enables real-time healthcare services to users. Wireless sensors can be used to monitor patients’ physical conditions and transfer real time vital signs to the emergency center or individual doctors. Wireless networks are subject to more packet loss and congestion. T...
متن کاملTemplate Synthesis of Un-Symmetrical Tetradentate Schiff Base Complexes of Ni(II), Co(II), Zn(II) and X-ray Structure of Ni(II) Complex
Metal complexes, ML (M=Ni, Cu, Co and Zn) of unsymmetrical tetradentate schiff base have been synthesized by the template reaction of the half-units N-(1-hydroxy-2-acetonaphthone)-1-amino-2-phenyleneimine)(HL1) with 2-Pyrroleca-rbaldehyde. The complexes have been characterized by elemental analysis, IR, 1H NMR and UV spectroscopy. The crystal structure of the Ni(II) complex has been determine...
متن کاملChebyshev polynomials over finite fields and reversibility of -automata on square grids
Using number theory on function fields and algebraic number fields we prove results about Chebyshev polynomials over finite prime fields to investigate reversibility of two-dimensional additive cellular automata on finite square grids. For example, we show that there are infinitely many primitive irreversible additive cellular automata on square grids when the base field has order two or three.
متن کاملHow to synchronize square arrays in optimum-time - A new square synchronization algorithm
The firing squad synchronization problem (FSSP, for short) on cellular automata has been studied extensively for more than fifty years, and a rich variety of synchronization algorithms have been proposed for oneand two-dimensional cellular automata. In the present paper, we propose a new optimum-time FSSP algorithm for two-dimensional square cellular automata. The algorithm can synchronize any ...
متن کاملBuilding blocks for the molecular expression of quantum cellular automata. Isolation and characterization of a covalently bonded square array of two ferrocenium and two ferrocene complexes.
The suitability of [{(eta5-C5H5)Fe(eta5-C5H4)}4(eta4-C4)Co(eta5-C5H5)][PF6]2, [1][PF6]2, for use as a molecular quantum cellular automata (QCA) cell is demonstrated. To this end the structure of 1 in the solid state and the conversion of 1 to mono- and dicationic mixed-valence complexes have been accomplished. The latter compounds have been isolated as pure materials and characterized by IR, EP...
متن کامل